Happy segments - HackerEarth Solution


Math Array

Python Code:

t = list(map(int, input().split()))
d = list(map(int, input().split()))
e = list(map(int, input().split()))
q = int(input())

for i in range(q):
    c = list(map(int, input().split()))
    s = {}
    count = 0
    for j in range(c[0] -1,c[1], 1 ):
        if d[j] not in s:
            s[d[j]] = 1
        else:
            s[d[j]] += 1


    for j in s:
        if(j != s[j]):
            count = 0
            break
        else:
            count= 1
    print(count)


Comments

Submit
0 Comments
More Questions

1496A - Split it
1666L - Labyrinth
1294B - Collecting Packages
1642B - Power Walking
1424M - Ancient Language
600C - Make Palindrome
1669D - Colorful Stamp
1669B - Triple
1669A - Division
1669H - Maximal AND
1669E - 2-Letter Strings
483A - Counterexample
3C - Tic-tac-toe
1669F - Eating Candies
1323B - Count Subrectangles
991C - Candies
1463A - Dungeon
1671D - Insert a Progression
1671A - String Building
1671B - Consecutive Points Segment
1671C - Dolce Vita
1669G - Fall Down
4D - Mysterious Present
1316B - String Modification
1204A - BowWow and the Timetable
508B - Anton and currency you all know
1672A - Log Chopping
300A - Array
48D - Permutations
677C - Vanya and Label